منابع مشابه
Hamiltonicity of large generalized de Bruijn cycles
In this article, we determine when the large generalized de Bruijn cycles BGC(p, d, n) are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized p-cycles. They are the Kronecker product of the generalized de Bruijn digraph GB(d, n) and the dicycle of length p, where GB(d, n) is the...
متن کاملFault-Tolerant Routings in Large Generalized Cycles
A generalized p-cycle i s a digraph whose set of vertices i s partitioned in p parts that can be ordered in such a way that a vertex is adjacent only to vertices in the next part. T h e families of B G C ( p , d : d k ) and K G C ( p , d , dP+k + d k ) are the largest known p-cyles f o r their degree and diameter. In this paper we present routing algorithms f o r both families. Such algorithms ...
متن کاملDisjoint paths of bounded length in large generalized cycles
A generalized p-cycle is a digraph whose set of vertices is partitioned in p parts that can bc ordered in such a way that a vertex is adjacent only to vertices in the next part. The families of B G C ( p , d , d ' ) and KGC(p ,d ,d "~ + d ' ) are the largest known p-cycles for their degree and diameter. [n this paper we present a lower bound for the fault-diameter of a generalized cycle. Then w...
متن کاملGeneralized de Bruijn Cycles
For a set of integers I, we define a q-ary I-cycle to be an assignment of the symbols 1 through q to the integers modulo qn so that every word appears on some translate of I. This definition generalizes that of de Bruijn cycles, and opens up a multitude of questions. We address the existence of such cycles, discuss “reduced” cycles (ones in which the all-zeroes string need not appear), and prov...
متن کاملLarge Subgraphs without Short Cycles
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs with m edges, what is the smallest size f(m,F) of a largest F–free subgraph? ii) Among all graphs with minimum degree δ and maximum degree ∆, what is the smallest minimum degree h(δ,∆,F) of a spanning F– free subgraph with largest minimum degree? These questions are easy to answer for families not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00120-6